Optimizing of ready-mixed concrete vehicle scheduling problem by hybrid heuristic algorithm
نویسندگان
چکیده
RMC (Ready-mixed concrete) vehicle scheduling problem is a complex combinatorial optimization problem with intersection of several research areas, such as logistics, just-in-time production and supply chains etc. We integrates RMC production scheduling and vehicle dispatch problems in the same framework by network flow techniques and establishes a mixed integer programming model for ready-mixed concrete vehicle scheduling problem. Then, we put forward a hybrid heuristic algorithm to optimize the RMC vehicle scheduling problem based on the characteristics of ready-mixed concrete vehicle fleet operations. The main idea of proposed hybrid heuristic algorithm is decomposing complex RMC vehicle scheduling problem into simple problems. Finally, the algorithm is used to solve specific simulation examples and to verify the effectiveness of the proposed hybrid heuristic algorithm.
منابع مشابه
Genetic algorithms for supply-chain scheduling: A case study in the distribution of ready-mixed concrete
The coordination of just-in-time production and transportation in a network of partially independent facilities to guarantee timely delivery to distributed customers is one of the most challenging aspect of supply chain management. From a theoretical perspective, the timely production/distribution can be viewed as a hybrid combination of planning, scheduling and routing problem, each notoriousl...
متن کاملSolving the vehicle routing problem by a hybrid meta-heuristic algorithm
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...
متن کاملSolving a New Multi-objective Unrelated Parallel Machines Scheduling Problem by Hybrid Teaching-learning Based Optimization
This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...
متن کاملGenetic algorithms in supply chain scheduling of ready- mixed concrete
The coordination of just-in-time production and transportation in a network of partially independent facilities to guarantee timely delivery to distributed customers is one of the most challenging aspect of supply chain management. From the theoretical perspective, the timely production/distribution can be viewed as a hybrid combination of planning, scheduling and routing problem, each notoriou...
متن کاملA Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs
This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...
متن کامل